Classes of sub-recursive function Selected bibliography

نویسندگان

  • Armando B. Matos
  • Philippe Andary
  • Bruno Patrou
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Implicit complexity in recursive analysis

Recursive analysis is a model of analog computation which is based on type 2 Turing machines. Various classes of functions computable in recursive analysis have recently been characterized in a machine independent and algebraical context. In particular nice connections between the class of computable functions (and some of its sub and supclasses) over the reals and algebraically defined (suband...

متن کامل

Computational capabilities of linear recursive networks

Recursive neural networks are a new connec-tionist model recently introduced for processing graphs. Linear recursive networks are a special sub-class where the neurons have linear activation functions. The approximation properties of recursive networks are tightly connected to the possibility of distinguishing the patterns by generating a different internal encoding for each input of the domain...

متن کامل

The Application of Recursive Mixed Models for Estimating Genetic and Phenotypic Relationships between Calving Difficulty and Lactation Curve Traits in Iranian Holsteins: A Comparison with Standard Mixed Models

In the present study, records on 22872 first-parity Holsteins collected from 131 herds by the Animal Breeding and Improvement Center of Iran from 1995 to 2014 were considered to estimate genetic and phenotypic relationships between calving difficulty (CD) and the lactation curve traits, including initial milk yield (Ap), ascending (Bp) and descending (Cp) slope of the lactation curves, peak mil...

متن کامل

Sub-computable Boundedness Randomness

This paper defines a new notion of bounded computable randomness for certain classes of sub-computable functions which lack a universal machine. In particular, we define such versions of randomness for primitive recursive functions and for PSPACE functions. These new notions are robust in that there are equivalent formulations in terms of (1) Martin-Löf tests, (2) Kolmogorov complexity, and (3)...

متن کامل

Characterizing sub-topical functions

In this paper, we first give a characterization of sub-topical functions with respect to their lower level sets and epigraph. Next, by using two different classes of elementary functions, we present a characterization of sub-topical functions with respect to their polar functions, and investigate the relation between polar functions and support sets of this class of functions. Finally, we obtai...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012